Reliability Ratio Weighted Bit Flipping– Sum Product Algorithm for Regular LDPC Codes
نویسندگان
چکیده
In this work, we introduce a novel decoding algorithm named “Reliability Ratio Weighted Bit Flipping–Sum Product” (RRWBFSP) is proposed for regular LDPC codes. “Sum [4] and Flipping” [6] are two separate methods that combined in the new algorithm. The simulations show to exceed Sum-Product algorithms by 0.34 dB. addition, when compared Sum-Product, RRWBFSP approach has about same computational complexity. Thus, codes, of which “Double-Orthogonal Convolutional Recursive” (RCDO) subfamily envisioned use electronic hard disks mobile terminals, can be easily iteratively decoded. This would have impact prolonging life batteries consequently reducing ecological footprint discarded batteries.
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملCheck Reliability Based Bit-Flipping Decoding Algorithms for LDPC Codes
We introduce new reliability definitions for bit and check nodes. Maximizing global reliability, which is the sum reliability of all bit nodes, is shown to be equivalent to minimizing a decoding metric which is closely related to the maximum likelihood decoding metric. We then propose novel bit-flipping (BF) decoding algorithms that take into account the check node reliability. Both hard-decisi...
متن کاملReliability ratio based weighted bit-flipping decoding for low-density parity-check codes - Electronics Letters
Introduction: The family of low-density parity-check (LDPC) codes proposed by Gallager [1] has attracted substantial research interest in the information theory community. LDPC codes can be decoded using various decoding schemes [1–4] such as hard-decisions, softdecisions and hybrid decoding schemes. The high-complexity sum-product algorithm (SPA) was shown to achieve a near-capacity performanc...
متن کاملSelf Reliability based Weighted Bit-Flipping Decoding for Low-density Parity-check Codes
Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF), the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: E3S web of conferences
سال: 2022
ISSN: ['2555-0403', '2267-1242']
DOI: https://doi.org/10.1051/e3sconf/202235101084